<HTML>
<HEAD>
  <TITLE>C++ Double-Ended Queues</TITLE>
</HEAD>
<BODY BGCOLOR="FFFFFF">

<TABLE WIDTH="100%" BGCOLOR="EEEEFF"><TR><TD>
  <A HREF="index.html">cppreference.com</A> -&gt; C++ Double-Ended Queues
</TD></TR></TABLE>

<H3>C++ Double Ended Queues</H3>

<TABLE>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#Operators" >Operators</A></TD>
<TD>compare and assign dequeues</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#assign" >assign()</A></TD>
<TD>set the values of the dequeue</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#at" >at()</A></TD>
<TD>returns a specific element</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#back" >back()</A></TD>
<TD>returns the last element</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#begin" >begin()</A></TD>
<TD>returns an iterator to the first element</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#clear" >clear()</A></TD>
<TD>remove all elements</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#empty" >empty()</A></TD>
<TD>true if the dequeue is empty</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#end" >end()</A></TD>
<TD>returns an iterator to the end of the queue</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#erase" >erase()</A></TD>
<TD>removes an element</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#front" >front()</A></TD>
<TD>returns the first element</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#get_allocator" >get_allocator()</A></TD>
<TD>returns the dequeue's allocator</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#insert" >insert()</A></TD>
<TD>insert elements into the dequeue</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#max_size" >max_size()</A></TD>
<TD>returns the maximum elements that the dequeue can hold</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#pop_back" >pop_back()</A></TD>
<TD>removes the last element</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#pop_front" >pop_front()</A></TD>
<TD>removes the first element</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#push_back" >push_back()</A></TD>
<TD>add an element to the end of the dequeue</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#push_front" >push_front()</A></TD>
<TD>add an element to the front of the dequeue</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#rbegin" >rbegin()</A></TD>
<TD>returns a reverse iterator to the end of the dequeue</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#rend" >rend()</A></TD>
<TD>returns a reverse iterator to the beginning of the dequeue</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#resize" >resize()</A></TD>
<TD>change the size of the dequeue</TD></TR>
<TR BGCOLOR="EEEEFF"><TD><A HREF="cppdequeue_details.html#size" >size()</A></TD>
<TD>return the number of elements in the dequeue</TD></TR>
<TR><TD><A HREF="cppdequeue_details.html#swap" >swap()</A></TD>
<TD>swap one dequeue with another</TD></TR>
</TABLE>

</BODY>
</HTML>
